A new entropy upper bound

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Tight Upper Bound on the Entropy of Sums

We consider the independent sum of a given random variable with a Gaussian variable and an infinitely divisible one. We find a novel tight upper bound on the entropy of the sum which still holds when the variable possibly has an infinite second moment. The proven bound has several implications on both information theoretic problems and infinitely divisible noise channels’ transmission rates.

متن کامل

An Upper Bound on the Entropy Series

where 0 log 0 is taken as 0. Assume that the p~ are nonincreasing in n (reordering of the p~ does not affect H) . In a recent paper, Keilson (1971) showed that a sufficient condition for the series in (1) to be summable is that oo (i) Z1 P~ log n < ~ and (ii) P,.k ~ 1 / kp , as n ~ ~ for all fixed h = 1, 2 , . . . . I t will follow from the results given here that condition (i) alone is suffici...

متن کامل

An Upper Bound on Quantum Entropy

Following ref [1], a classical upper bound for quantum entropy is identified and illustrated, 0 ≤ Sq ≤ ln(eσ/ 2~), involving the variance σ in phase space of the classical limit distribution of a given system. A fortiori, this further bounds the corresponding information-theoretical generalizations of the quantum entropy proposed by Rényi.

متن کامل

An Upper Bound for Uniform Entropy Numbers

Let r > 1 and let Q be a probability measure on a measurable space (X, .4). In this note, we present a proof of a useful bound in Lr ( Q)-norm for the entropy of a convex hull in the case that covering numbers for a class of measurable functions are polynomial.

متن کامل

New Upper Bound and Lower Bound for Degree-Based Network Entropy

The degree-based network entropy which is inspired by Shannon’s entropy concept becomes the information-theoretic quantity for measuring the structural information of graphs and complex networks. In this paper, we study some properties of the degree-based network entropy. Firstly we develop a refinement of Jensen’s inequality. Next we present the new and more accurate upper bound and lower boun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2012

ISSN: 0893-9659

DOI: 10.1016/j.aml.2012.02.056